Crowdsourcing Complex Language Resources: Playing to Annotate Dependency Syntax
نویسندگان
چکیده
This article presents the results we obtained on a complex annotation task (that of dependency syntax) using a specifically designed Game with a Purpose, ZombiLingo.1 We show that with suitable mechanisms (decomposition of the task, training of the players and regular control of the annotation quality during the game), it is possible to obtain annotations whose quality is significantly higher than that obtainable with a parser, provided that enough players participate. The source code of the game and the resulting annotated corpora (for French) are freely available.
منابع مشابه
Querying Large Linked Data Resources
Exploring large complex linked data resources is challenging as it requires not only mastering SPARQL syntax and semantics but also understanding the RDF data model and large ontology vocabularies comprising of thousands of classes, hundreds of properties and millions of URIs for instances of interest. Natural language question answering systems solve the problem, but these are still subjects o...
متن کاملPredicting Opinion Dependency Relations for Opinion Analysis
Syntactic structures have been good features for opinion analysis, but it is not easy to use them. To find these features by supervised learning methods, correct syntactic labels are indispensible. Two possible sources to acquire syntactic structures are parsing trees and dependency trees. For the annotation processing, parsing trees are more readable for annotators, while dependency trees are ...
متن کاملUniversal Dependencies for Swedish Sign Language
We describe the first effort to annotate a signed language with syntactic dependency structure: the Swedish Sign Language portion of the Universal Dependencies treebanks. The visual modality presents some unique challenges in analysis and annotation, such as the possibility of both hands articulating separate signs simultaneously, which has implications for the concept of projectivity in depend...
متن کاملAnnotation of Multiword Expressions in the Prague Dependency Treebank
We describe annotation of multiword expressions in the Prague Dependency Treebank, using several automatic pre-annotation steps. We use subtrees of the tectogrammatical tree structures of the Prague dependency treebank to store representations of the multiword expressions in the dictionary and pre-annotate following occurrences automatically. We also show a way to measure reliability of this ty...
متن کاملTransforming Dependency Structures to Logical Forms for Semantic Parsing
The strongly typed syntax of grammar formalisms such as CCG, TAG, LFG and HPSG offers a synchronous framework for deriving syntactic structures and semantic logical forms. In contrast—partly due to the lack of a strong type system—dependency structures are easy to annotate and have become a widely used form of syntactic analysis for many languages. However, the lack of a type system makes a for...
متن کامل